On minimum dominating sets with minimum intersection
نویسندگان
چکیده
منابع مشابه
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs
We prove that the problem of nding two minimum dominating sets (connected dominating sets or vertex clique covers) with minimum intersection is linearly solvable in interval graphs. Furthermore, the problem of deciding whether or not there exist two disjoint minimum dominating sets (connected dominating sets or vertex clique covers) is shown to be NP-hard for chordal graphs.
متن کاملCounting Minimum Weighted Dominating Sets
We show how to count all minimumweighted dominating sets of a graph on n vertices in timeO(1.5535).
متن کاملTrees with unique minimum p - dominating sets ∗
Let p be a positive integer and G = (V,E) a simple graph. A p-dominating set of G is a subset S of V such that every vertex not in S is dominated by at least p vertices in S. The p-domination number γp(G) is the minimum cardinality among the p-dominating sets of G. In this paper, for p ≥ 2, we give three equivalent conditions for trees with unique minimum p-dominating sets and also give a const...
متن کاملTrees with unique minimum total dominating sets
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. We provide three equivalent conditions for a tree to have a unique minimum total dominating set and give a constructive characterization of such trees.
متن کاملBlock graphs with unique minimum dominating sets
For any graph G a set D of vertices of G is a dominating set, if every vertex v∈V (G)− D has at least one neighbor in D. The domination number (G) is the smallest number of vertices in any dominating set. In this paper, a characterization is given for block graphs having a unique minimum dominating set. With this result, we generalize a theorem of Gunther, Hartnell, Markus and Rall for trees. c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90364-n